Residency Check Elimination for Object-Oriented Persistent Language

We explore !.he ramifications ofobject residency assumptions and their impact on residency checking for several subroutine dispatch scenarios: procedural, static object-oriented, and dynamic (virtual) object-oriented. We obtain dynamic counts of the residency checks necessary for execution of several benchmark persistent programs under each of these scenarios. The resuhs reveal that significant reductions in the number of residency checks can be achieved through application of residency rules derived from lhe dispatch scenario under which a program executes, as well as additional constraints specific lo the language in which it is implemented.